1.A Agrawal, R., & Srikant. 1995. Mining Sequential Pattern. Eleventh International Conference on Data Engineering, Taipei, Taiwan, 3-14.

2.X. Yan, J. Han, & R, Afshar. 2003. CloSpan: Mining closed sequential patterns in large databases. Proc. SIAM Int’l Conf. Data Mining, 166-177.

3.M. Zaki. 2001. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 42, 31-60.

4.J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu, 2001. “PrefixSpan : Mining sequential patterns efficiently by prefixprojected pattern growth,” Proc. Int’l Conf. Data Engineering (ICDE ’01), pp. 215-224.

5.J. Ayres, J. Gehrke, T. Yiu, and J. Flannick, 2002. “Sequential pattern mining using a bitmap representation,” Proc. ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (SIGKDD ’02), pp. 429-435.

6.Qiankun Zhao and Sourav S. Bhowmick, “Sequential Pattern Mining: A Survey”. (2003). Technical Report, CAIS, Nanyang Technological University, Singapore, 118.

7.R. Agrawal and R. Srikant, 1995. “Mining Sequential Patterns”, In Proceedings of the 11th International Conference on Data Engineering, pp. 3-14, Taipei, Taiwan.

8.Salvatore Orlando, Raffaele Perego and Claudio Silvestri, A new algorithm for gap constrained sequence mining. 2004. In Proceedings of the ACM Symposium on Applied Computing, 540-547.

9.Manan Parikh, Bharat Chaudhari and Chetna Chand, 2013. A Comparative Study of Sequential Pattern Mining Algorithms, Volume 2, Issue 2, February 2013, International Journal of Application or Innovation in Engineering & Management (IJAIEM).

10.Thabet Slimani, and Amor Lazzez, Sequential Mining: Patterns And Algorithms Analysis.

11.J. Pei, J. Han, and R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets. (may 2000). Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD ’00), 21-30.

12.M. Zaki and C. Hsiao, CHARM: An efficient algorithm for closed itemset mining. (april 2002). Proc. SIAM Int’l Conf. Data Mining (SDM ’02), 457-473.

13.J. Pei, J. Han, and R. Mao, “CLOSET: An efficient algorithm for mining frequent closed itemsets,” Proc. ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD ’00), pp. 21-30, May 2000.

14.J. Wang, J. Han, and J. Pei, CLOSET : Searching for the best strategies for mining frequent closed itemsets. (aug 2003). Proc. ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (SIGKDD ’03), 236-245.

15.M. Zaki and C. Hsiao, “CHARM: An efficient algorithm for closed itemset mining,” Proc. SIAM Int’l Conf. Data Mining (SDM ’02), pp. 457-473, Apr. 2002.